Byzantine Agreement, Made Trivial
نویسنده
چکیده
We present a very simple, cryptographic, Byzantine-agreement protocol that, with n = 3t + 1 players, t of which are malicious, halts in expected 9 rounds.
منابع مشابه
Byzantine Preferential Voting
In the Byzantine agreement problem, n nodes with possibly different input values aim to reach agreement on a common value in the presence of t < n/3 Byzantine nodes which represent arbitrary failures in the system. This paper introduces a generalization of Byzantine agreement, where the input values of the nodes are preference rankings of three or more candidates. We show that consensus on pref...
متن کاملCas Cs 537 :
Distributed computing often involves a set of n processes arriving at a consensus/agreement on some bit v, in a de-centralized fashion. The problem is particularly interesting in the presence of Byzantine failures, i.e., an adversary may adaptively corrupt upto t among these n processes and cause them to behave arbitrarily in the consensus protocol. To elaborate, these processes may either comp...
متن کاملAgreement in synchronous networks with ubiquitous faults
In this paper we are interested in synchronous distributed systems subject to transient and ubiquitous failures. This includes systems where failures will occur on any communication link, systems where every processor will experience at one time or another send or receive failure, etc., and, following a failure, normal functioning resuming after a finite time. Notice that these cases cannot be ...
متن کاملThe Stellar Consensus Protocol - A federated model for Internet-level consensus
This paper introduces a new model for consensus called federated Byzantine agreement (FBA). FBA achieves robustness through quorum slices—individual trust decisions made by each node that together determine system-level quorums. Slices bind the system together much the way individual networks’ peering and transit decisions now unify the Internet. We also present the Stellar Consensus Protocol (...
متن کاملSignature-Free Communication and Agreement in the Presence of Byzantine Processes (Tutorial)
Communication and agreement are fundamental abstractions in any distributed system. (If the computing entities do not need to communicate or agree in one way or another, the system is not a distributed system!) This tutorial was devoted to the design of such abstractions built on top of signature-free asynchronous distributed systems prone to Byzantine process failures. It is made up of three p...
متن کامل